On Achieving Lower Consecutive Losses for Continuous Media Streams
نویسندگان
چکیده
With the growing popularity of the Internet, there is increasing interest in using it for audio and video transmission. Periodic network overloads, leading to bursty packet losses, have always been a key problem for network researchers. In a long-haul, heterogeneous network like the Internet, handling such an error becomes especially difficult. Perceptual studies of audio and video viewing have shown that bursty losses have the most annoying effect on people, and hence are critical issues to be addressed for applications such as Internet phone, video conferencing, distance learning, etc. Classical error handling techniques have focused on applications like FTP, and are geared towards ensuring that the transmission is correct, with no attention to timeliness. For isochronous traffic like audio and video, timeliness is a key criterion, and given the high degree of content redundancy, some loss of content is quite acceptable. In this paper we introduce the concept of error spreading, which is a transformation technique that takes the input sequence of packets (from an audio or video stream) and scrambles its packet before transmission. The packets are unscrambled at the receiving end. The transformation is designed to ensure that bursty losses in the transformed domain get spread all over the sequence in the original domain. Perceptual studies have shown that users are much more tolerant of a uniformly distributed loss of low magnitude. We next describe a continuous media transmission protocol based on this idea, and validate its performance through an experiment performed on the Internet.
منابع مشابه
An Adaptive, Perception-Driven Error Spreading Scheme in Continuous Media Streaming
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studies on human perception of audio and video streams have shown that bursty losses have the most annoying affects. Hence, addressing this issue is critical for multimedia applications such as Internet phone, video conferen...
متن کاملScalable Method for Continuous Media Streaming on Peer-to-Peer Networks
With the growth of computing power and the proliferation of broadband access to the Internet, streaming distribution services have widely diffused. Content providers apply the proxy caching technique to accomplish effective streaming distribution services. However, the current proxy mechanism has several problems in achieving scalability to the number of users and flexibility in handling the di...
متن کاملPerformance evaluation of media losses in the Continuous Media Toolkit
This paper shows a methodology for user-driven, top down approach to research in quality of service issues in multimedia systems. As a case study, we show a development of metrics, validation by means of a user study, and a performance evaluation of a prototyping environments. What is used, the Berkeley Continuous Media Toolkit (CMT) is a popular environment that satis es this need. Form a huma...
متن کاملDynamic Window-Constrained Scheduling for Real-Time Media Streaming
This paper describes an algorithm for scheduling packets in real-time multimedia data streams. Common to these classes of data streams are service constraints in terms of bandwidth and delay. However, it is typical for realtime multimedia streams to tolerate bounded delay variations and, in some cases, finite losses of packets. We have therefore developed a scheduling algorithm that assumes str...
متن کاملScheduling of ContinuousMedia Streams ?
We present a model for an interactive continuous media server. Such server systems work in an online environment without knowing future requirements of the customers. We apply competitive analysis to study diierent scenarios of the design and control of a server and we give upper and lower bounds for the competitive ratio.
متن کامل